Finding a Path to Model Consistency
نویسندگان
چکیده
A core problem in Model Driven Engineering is model consistency achievement: all models must satisfy relationships constraining them. Active consistency techniques monitor and control models edition for preventing inconsistencies, e.g., using automatic errors correction. The main problem of these approaches is that strict enforcement of consistency narrows the modeler’s possibilities for exploring conflicting or tradeoff solutions; this is just what temporaries inconsistencies enable. In this article, we propose a hybrid approach capitalizing on active consistency characteristics while allowing the user to edit inconsistent models in a managed mode: at any moment we are able to propose a sequence of modelling operations that, when executed, make the model consistent. The solution consists in defining a set of automatons capturing a sufficient part of the model state space for managing any inconsistent situation. We illustrate this approach on a consistency relationship implied by the application of a security design pattern impacting both class and sequence diagrams of a UML2 model.
منابع مشابه
Factorial Validity and Internal Consistency of The Sports Imagery Ability Questionnaire (SIAQ) Malaysian Version
Background. Imagery ability is one of the most potent factors influencing imagery effectiveness. Therefore, prior to imagery training, it is important to assess the participant’s imagery ability, typically using a self-report questionnaire. Objectives. This study examined the factorial validity and internal consistency of the Malaysian adapted SIAQ using confirmatory factor analysis and Cronba...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملA suitable data model for HIV infection and epidemic detection
Background: In recent years, there has been an increase in the amount and variety of data generated in the field of healthcare, (e.g., data related to the prevalence of contagious diseases in the society). Various patterns of individuals’ relationships in the society make the analysis of the network a complex, highly important process in detecting and preventing the incidence of diseases....
متن کاملFinding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کامل